Disproof of a Conjecture by Rademacher on Partial Fractions
نویسندگان
چکیده
In his book Topics in Analytic Number Theory (1973), Hans Rademacher considered the generating function of integer partitions into at most N parts and conjectured certain limits for the coefficients of its partial fraction decomposition. We carry out an asymptotic analysis that disproves this conjecture, thus confirming recent observations of Sills and Zeilberger (Journal of Difference Equations and Applications 19 (2013)), who gave strong numerical evidence against the conjecture.
منابع مشابه
COMPUTATION OF q-PARTIAL FRACTIONS
We study a special partial fraction technique which is designed for rational functions with poles on the unit circle, known as q-fractions. Even though the theory of q-partial fractions has already been applied to the Rademacher Conjecture, no systematic computational development appeared. In this paper we present two algorithms for the computation of q-partial fractions and highlight certain p...
متن کاملDisproof of the Mertens Conjecture
The Mertens conjecture states that M(x) < x ⁄2 for all x > 1, where M(x) = n ≤ x Σ μ(n) , and μ(n) is the Mo bius function. This conjecture has attracted a substantial amount of interest in its almost 100 years of existence because its truth was known to imply the truth of the Riemann hypothesis. This paper disproves the Mertens conjecture by showing that x → ∞ lim sup M(x) x − ⁄2 > 1. 06 ....
متن کاملRademacher’s Infinite Partial Fraction Conjecture Is False
In his book Topics in Analytic Number Theory, Hans Rademacher conjectured that the limits of certain sequences of coefficients that arise in the ordinary partial fraction decomposition of the generating function for partitions of integers into at most N parts exist and equal particular values that he specifies. Despite being open for nearly four decades, little progress has been made toward pro...
متن کاملOn Rademacher’s Infinite Partial Fraction Conjecture
" It is a capital mistake to theorise before one has data. Insensibly one begins to twist facts to suit theories, instead of theories to suit facts. " —Sherlock Holmes to Dr. contains lots of supporting input and output files.
متن کامل1 1 O ct 2 01 1 Disproof of the List Hadwiger Conjecture
The List Hadwiger Conjecture asserts that every Kt-minor-free graph is t-choosable. We disprove this conjecture by constructing a K3t+2-minor-free graph that is not 4tchoosable for every integer t ≥ 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014